The Expression Lemma

نویسندگان

  • Ralf Lämmel
  • Ondrej Rypacek
چکیده

Algebraic data types and catamorphisms (folds) play a central role in functional programming as they allow programmers to define recursive data structures and operations on them uniformly by structural recursion. Likewise, in object-oriented (OO) programming, recursive hierarchies of object types with virtual methods play a central role for the same reason. There is a semantical correspondence between these two situations which we reveal and formalize categorically. To this end, we assume a coalgebraic model of OO programming with functional objects. The development may be helpful in deriving refactorings that turn sufficiently disciplined functional programs into OO programs of a designated shape and vice versa.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A simple proof of Zariski's Lemma

‎Our aim in this very short note is to show that the proof of the‎ ‎following well-known fundamental lemma of Zariski follows from an‎ ‎argument similar to the proof of the fact that the rational field‎ ‎$mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.

متن کامل

Generalizations of Borel-Cantelli Lemma

The Borel-Cantelli Lemma is very important in the probability theory‎. ‎In this paper‎, ‎we first describe the general case of the Borel-Cantelli Lemma‎. ‎The first part of this lemma‎, ‎assuming convergence and the second part includes divergence and independence assumptions‎. ‎In the following‎, ‎we have brought generalizations of the first and second part of this lemma‎. ‎In most generalizat...

متن کامل

Fuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma

The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.

متن کامل

Morpho-phenology and chromosome number of Iranian Bromus danthoniae Trin. genotypes

ABSTRACT- Bromus danthoniae Trin. is an annual grass species which grows mainly on dry grassy rocky mountain slopes and grassy steppe, and is grazed by many herbivores and recognized as a useful pasture plant. The chromosome number, morphological and anatomical traits of 82 genotypes of B. danthoniae belonging to three sub-taxa were investigated. Twenty-seven quantitative and 20 qualitative mor...

متن کامل

Application of Hopf's lemma on contact CR-warped product submanifolds of a nearly Kenmotsu manifold

In this paper we consider contact CR-warped product submanifolds of the type $M = N_Ttimes_f N_perp$, of a nearly Kenmotsu generalized Sasakian space form $bar M(f_1‎, ‎f_2‎, ‎f_3)$ and by use of Hopf's Lemma we show that $M$ is simply contact CR-product under certain condition‎. ‎Finally‎, ‎we establish a sharp inequality for squared norm of the second fundamental form and equality case is dis...

متن کامل

Construction of rational expression from tree automata using a generalization of Arden's Lemma

Arden’s Lemma is a classical result in language theory allowing the computation of a rational expression denoting the language recognized by a finite string automaton. In this paper we generalize this important lemma to the rational tree languages. Moreover, we propose also a construction of a rational tree expression which denotes the accepted tree language of a finite tree automaton.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008